Equal resource sharing scheduling for PCS data services

نویسندگان

  • Jeu-Yih Jeng
  • Yi-Bing Lin
چکیده

For high speed mobile communication applications, the data rate can be increased by using multiple channels (or time slots) instead of one channel. To reduce the high blocking rate of multiple channels assignment, exible resource allocation strategies have been proposed. This paper proposes the Equal Resource Sharing Allocation scheme (ERSA scheme) for exible resource allocation. The ERSA scheme dynamically averages the allocated resource to the call requests based on the number of calls in a base station. The scheme accommodates the maximum number of requests while providing acceptable quality to the admitted requests. We developed an analytic model to investigate the performance of ERSA, and conducted simulation experiments to validate the analytic model. We deene satisfaction indication SI as the performance measurement of the resource allocation algorithm. The experiment results indicate that the ERSA scheme outperforms other resource allocation algorithms proposed in our previous study.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Optimal Utilization of Cloud Resources using Adaptive Back Propagation Neural Network and Multi-Level Priority Queue Scheduling

With the innovation of cloud computing industry lots of services were provided based on different deployment criteria. Nowadays everyone tries to remain connected and demand maximum utilization of resources with minimum timeand effort. Thus, making it an important challenge in cloud computing for optimum utilization of resources. To overcome this issue, many techniques have been proposed ...

متن کامل

Integrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment

Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...

متن کامل

Policy Model for Sharing Network Slices in 5G Core Network

As mobile data traffic increases, and the number of services provided by the mobile network increases, service load flows as well, which requires changing in the principles, models, and strategies for media transmission streams serving to guarantee the given nature of giving a wide scope of services in Flexible and cost-effective. Right now, the fundamental question remains what number of netwo...

متن کامل

AutoVNF: An Automatic Resource Sharing Schema for VNF Requests

Nowadays, network function virtualization (NFV) receives widespread concerns from the whole society for its promising application. The main challenge for the deployment of VNF that comes along is the resource allocation of demanded network services in NFV-based network infrastructures. Current offline resource mapping and scheduling algorithms are impractical for continuous VNF requests in data...

متن کامل

Improving Throughput and Fairness on the Downlink Shared Channel in UMTS WCDMA Networks

A resource scheduling scheme is presented to improve throughput and fairness for NRT packet data traffic on the downlink shared channel of a UMTS WCDMA network supporting multiple services. The proposed Fair Resource Scheduling (FRS) scheme takes into account link conditions to enhance throughput and provides fair resource sharing among traffic flows. FRS includes service priority handling duri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Wireless Networks

دوره 5  شماره 

صفحات  -

تاریخ انتشار 1999